home *** CD-ROM | disk | FTP | other *** search
-
-
- CRYPT-O-SEARCH (TM)
- Copyright 1989, 1990
- Castle Oaks Computer Services
- Post Office Box 36082
- Indianapolis, IN 46236-0082
-
- CRYPT-O-SEARCH (TM) is a word search puzzle generator. It can create ordinary
- word search puzzles, but it also has the capability of encrypting the word
- list to add a little more challenge to the puzzle.
-
- CRYPT-O-SEARCH (TM) is a shareware program which you may share with your
- friends. However, users are encouraged to register by sending a registration
- fee of $10.00 to the above address. Upon registration, you will be sent the
- latest version of the program and you will be notified of any upgrades and
- other products available from Castle Oaks.
-
- Attention International customers: The above registration fee is to be
- paid in U. S. Dollars, preferably by International Money Order. In
- addition to the registration fee, include $2.00 to cover additional
- postage that is required.
-
- You may create puzzles which you sell for publication. However, if the pro-
- gram is used for monetary gain, registration is required and a royalty is
- payable on all puzzles sold.
-
- The following rules must be followed in such cases:
-
- 1. Puzzles must be in good taste as judged by the mores of the
- general population.
-
- 2. The Puzzle must display the trademark and its owner, Castle Oaks
- Computer Services.
-
- 3. A royalty must be paid for each puzzle published. The fee is
- $5.00 or 15% of the amount received for the puzzle, whichever is
- greater.
-
- 4. A copy of the puzzle being published must be sent to Castle Oaks
- along with the royalty payment. Also include the name and date of
- the publication in which it will appear.
-
- Failure to abide by the above rules will lead to legal action.
-
-
- USAGE
-
- CRYPT-O-SEARCH (TM) is easy and fun to use. It is great for creating puzzles
- for use at parties. You can make up puzzles containing the names, interests,
- etc. of persons attending the party. No installation is required. You can
- run it from floppy by entering the name of the executable file (CRYPSRCH) or
- you may copy it to hard disk and run it from there. There are certain
- requirements and restrictions.
-
- 1. You must have a printer and it must be turned on, on-line and
- the paper should be positioned at top-of-form. In order to use
- version 2.2 (and later) your printer must be capable of backspacing.
- If it does not have that capability, some lines in the solution
- printout may not be correct. If this presents a problem, the
- registered package contains an older version (1.1) which doesn't use
- backspacing. The solution will probably look best when printed in
- draft mode. You should experiment with number of characters per
- inch and number of lines per inch on your printer to achieve the
- most pleasing printout. In order to show the connections between
- words, it was necessary to add extra lines in the solution. This
- was done so that the solution could be displayed on most printers;
- therefore the aspect ratio of the solution will be different from
- that of the puzzle.
-
-
- (Actually the program may be run without the printer. When asked
- for number of copies to be printed you may respond with zero.
- However, the program is not very useful without hard copy output.)
-
- 2. Your puzzle can have dimensions of up to 40 by 40. In most
- cases, much smaller puzzles, 20 by 20 or smaller, are quite satis-
- factory.
-
- 3. Words for the puzzle may only contain alphabetic characters.
- Although you may enter lower case, all characters will be converted
- to upper case. Non alphabetic characters will be discarded. You
- may enter up to one hundred words. Again, a shorter word list (e.g.
- 25) is usually satisfactory.
-
- 4. On screen prompts are provided to guide you through the process.
- The program will request the width and length of the puzzle and the
- number of words that you are going to enter. (Note: The puzzle does
- not have to be square. However, all words must be no longer than
- the shorter dimension of the puzzle.)
-
- 5. The puzzle will give you instructions about entering the words.
- You may correct any word before hitting carriage return, and you may
- even re-enter the previous word. You may also terminate entering
- words before reaching the number that you specified at the start.
- The current version prints out your list of words after you finish
- entering them. You are then given the opportunity to correct a
- specific word if necessary. This process continues until you are
- satisfied that your word list is as you want it.
-
- 6. A special feature is included for avoiding situations that might
- be undesirable. For example, you may want to enter the two words,
- "BACKROOM" and "ROOMMATE". If you do, there is the possibility that
- they will share all the letters of "ROOM". You may like that or you
- may not, if not, just prefix "ROOMMATE" with an "X". The puzzle
- will then contain the word "XROOMMATE" but your word list will have
- the "X" purged and the solver will only look for the word
- "ROOMMATE". This means that no words can begin with the letter "X".
- If you want a word to begin with an "X", just prefix it with another
- "X" which will be purged from the word list. Another example where
- you would be more likely to use this feature is when one word would
- be wholly contained in another word. "VIRGINIA" and WESTVIRGINIA"
- or "THE" and "EITHER". In such cases, just prefix the shorter word
- with an "X".
-
- 7. After accepting your word list, you are asked if you wish to
- have the word list encrypted. If you respond "Y" or "y", the word
- list will be encrypted, and will be printed out with the puzzle
- (words in the puzzle are not encrypted.) The printout of the solu-
- tion will contain the word list in unencrypted form.
-
- 8. After you respond to the above mentioned question, the program
- starts to build the puzzle. During this process, the program dis-
- plays some information about how it is progressing. This is to
- provide you with the assurance the program is functioning, and also
- to give you information that you may use if you decide to do the
- puzzle over. So that you can understand what the program is telling
- you, an explanation of how the program functions is given below in
- the section describing functionality.
-
-
- 9. After all words have been positioned in the puzzle, it will be
- displayed on the screen without the fill characters. (Note: If your
- puzzle is more than 23 lines long, the display will only show the
- last 23 lines.) You are given the option to accept the puzzle, abort
- it entirely, or you may ask the program to reposition the words if
- you do not like the looks of the puzzle.
-
- 10. After accepting the puzzle, you will be queried if you want to
- place the puzzle and/or solution in a file(s); it will also query
- for the number of puzzles you want printed and the number of solu-
- tions you want printed. The printout of the solution gives only the
- letters of the word list and does not printout the fill characters
- put in the puzzle itself. In addition, connecting lines are includ-
- ed to help define the individual words. This is not as satisfactory
- as printing "bubbles" around the words but adding that capability
- would require that the user have a printer with graphics capability
- and it would be necessary to add drivers for all different types of
- printers. Such an approach is not economically feasible for a
- shareware product.
-
- FUNCTIONALITY
-
- The program functions as follows:
-
- The word list is sorted by word length, longest word first.
-
- The longest word is positioned near the center of the puzzle diagonally.
-
- Then attempts are made to insert each of the other words. For each word, one
- of the letters is selected at random; the puzzle is then searched to see if
- that letter exists in the puzzle; if it does, an attempt is made to insert the
- word in some direction to cross another word. The program shows you the
- position in the sorted list of the word being positioned, the word being
- positioned, the starting direction ("S", "SE", etc.) and then each letter of
- the word as it is tried. For example, suppose the third word in the list,
- "EXAMPLE", is being positioned, the display might show:
-
- 3 EXAMPLE SW AMPLEEX NE AMPL
-
- This means that it is the third word in the list and an attempt was first made
- to insert the word in the southwest direction, first with the letter "A" as an
- intersection, then with other letters as the intersection. After cycling
- through all letters of the word, a new direction was selected and the cycling
- through of the letters was restarted at "A". In the new direction, NE, suc-
- cess was reached with the letter "L" intersecting with some other word that
- had already been inserted. (There may be other intersections also.) If all 8
- directions do not yield an intersection with another word, then an attempt is
- made to insert the word elsewhere. The display will show only the direction,
- if successful. If after a number of attempts, the program cannot fit the word
- in, a message will appear to that effect and you will be given the options of:
- discarding the word from the list, or requesting that the program starts over
- in the hope that different positioning of other words will allow this word to
- fit in. The display of the progress may appear too fast on the screen for you
- to read it, let alone understand it. You may pause the display by using
- control-S. You may also send the screen output to the printer by using con-
- trol-P. If you do the latter, you should toggle it off and reposition your
- paper before printing the puzzle and/or the solution.
-
-
-
-
- Note: Each time the program starts, the random number generator starts with a
- different value. Therefore it is not possible to duplicate a given puzzle.
- This can be useful.
-
- NOTE
-
- This is the shareware version of CRYPT-O-SEARCH. It contains the executable
- files, CRYP24S.EXE and CRYP24P.EXE. The "S" version is the Secondary version
- which is aimed at puzzle solvers above the Primary level. It puts words into
- a puzzle in left-to-right, top-to-bottom, and left-to-right on two diagonals.
- The "P" (Primary) version only puts words in left-to-right and top-to-bottom.
- If you register, you will receive Version 2.4 which places words in all eight
- possible directions.